Crossing Numbers and Parameterized Complexity
نویسندگان
چکیده
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the odd crossing number of G whose crossing number is at most 9, where k is the odd crossing number of G. As a consequence of this and a result of Grohe we can show that the odd crossing number is fixed-parameter tractable.
منابع مشابه
A note on the complexity of deterministic tree-walking transducers
The deterministic tree-walking transducer is one of a number of possible formalisms for defining mildly context-sensitive languages. It is well known that the non-uniform membership problem for languages that can be defined in this formalism is solvable in polynomial time. The uniform membership problem, where both the transducer and the word in question are considered part of the input, is les...
متن کاملParameterized Complexity of 1-Planarity
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter ...
متن کاملKemeny Elections with Bounded Single-Peaked or Single-Crossing Width
This paper is devoted to complexity results regarding specific measures of proximity to singlepeakedness and single-crossingness, called “singlepeaked width” [Cornaz et al., 2012] and “singlecrossing width”. Thanks to the use of the PQ-tree data structure [Booth and Lueker, 1976], we show that both problems are polynomial time solvable in the general case (while it was only known for single-pea...
متن کاملOn Detecting Nearly Structured Preference Profiles
Structured preference domains, such as, for example, the domains of single-peaked and single-crossing preferences, are known to admit efficient algorithms for many problems in computational social choice. Some of these algorithms extend to preferences that are close to having the respective structural property, i.e., can be made to enjoy this property by performing minor changes to voters’ pref...
متن کاملCrossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable with respect to treewidth, and that computing the 2-page crossing number is fixed-parameter tractable with respect to the sum of the number of c...
متن کامل